Extending First-Order Uni cation by Tractable Second-Order Features

نویسنده

  • Bernhard Gramlich
چکیده

We present a new approach for solving certain innnite sets of rst order uniication problems represented by term schemes. Within the framework of second-order equational logic solving such scheme uniication problems amounts exactly to solving (variable-)restricted uniication problems. Finally, we show how this approach yields a generic solution technique for innnitely many ordinary rst-order uniication problems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Syntactic Uni cation Problems under Constrained Substitutions

Some kind of practical problems such as security veri cation of cryptographic protocols can be described as a problem to accomplish a given purpose by using limited operations and limited materials only. To model such problems in a natural way, uni cation problems under constrained substitutions have been proposed. This paper is a collection of results on the decidability and the computational ...

متن کامل

Decidable Higher-Order Unification Problems

Second order uni cation is undecidable in general Miller showed that uni cation of so called higher order patterns is decidable and unitary We show that the uni cation of a linear higher order pat tern s with an arbitrary second order term that shares no variables with s is decidable and nitary A few extensions of this uni cation problem are still decidable unifying two second order terms where...

متن کامل

Higher-Order Narrowing

We introduce several approaches for solving higher order equational problems by higher order narrow ing and give rst completeness results The results apply to higher order functional logic programming languages and to higher order uni cation modulo a higher order equational theory We lift the general notion of rst order narrow ing to so called higher order patterns and argue that the full highe...

متن کامل

Logic Program Schemas, Constraints and Semi-Uni cation

Program schemas are known to be useful in di erent applications such as program synthesis, transformation, analysis, debugging, teaching : : :This paper tackles two complementary aspects of program schemas. We rst propose a language for the description of program schemas. It is based on a subset of second-order logic, enhanced with constraints and speci c features of program schemas. One of the...

متن کامل

Solving higher order equations: from logic to programming

Higher order constructs provide the necessary level of abstraction for concise and natural formulations in many areas of computer science We present constructive methods for higher order equational reasoning with applications ranging from theorem proving to novel programming concepts A major problem of higher order programming is the undecidability of higher order uni cation In the rst part we ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000